Global Theory of Extended Generating Functions
نویسنده
چکیده
The global theory of generating functions of canonical transformations is developed. Utilizing methods of symplectic geometry, we present the geometrical interpretation of the various objects appearing in the theory, that allows to de ne in nitely many types of generators, some of which can be de ned globally. Some interesting transformation properties are derived. Use of generators in applications in applied mathematics (symplectic numerical integration) and physics (nonlinear beam dynamics) are outlined.
منابع مشابه
Probability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملMODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS
Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....
متن کاملON THE FUZZY SET THEORY AND AGGREGATION FUNCTIONS: HISTORY AND SOME RECENT ADVANCES
Several fuzzy connectives, including those proposed by Lotfi Zadeh, can be seen as linear extensions of the Boolean connectives from the scale ${0,1}$ into the scale $[0,1]$. We discuss these extensions, in particular, we focus on the dualities arising from the Boolean dualities. These dualities allow to transfer the results from some particular class of extended Boolean functions, e.g., from c...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملOn composition of generating functions
In this work we study numbers and polynomials generated by two type of composition of generating functions and get their explicit formulae. Furthermore we state an improvementof the composita formulae's given in [6] and [3], using the new composita formula's we construct a variety of combinatorics identities. This study go alone to dene new family of generalized Bernoulli polynomials which incl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006